Symmetric Colorings Of Regular Polygons
نویسنده
چکیده
It is calculated the number of symmetric r-colorings of vertices of a regular n-gon and the number of equivalence classes of symmetric r-colorings [1, 2]. A coloring is symmetric if it is invariant in respect to some mirror symmetry with an axis crossing center of polygon and one of its vertices. Colorings are equivalent if we can get one from another by rotating about the polygon center.
منابع مشابه
Perceived shape regularity does not depend on regularities along the contour.
In four experiments we investigated whether human observers are able to use certain regularities in polygons when they have to indicate which polygon they perceive as the more regular in a paired comparison task. From our results we conclude that regularities that are restricted to the contour do not play a role in judgments of regularity. For instance, equilateral polygons are not considered t...
متن کاملOn Further Polygonal Designs using Linked Triangular Structures other than Spidrons and Tiling Patterns generated by them
A regular n-sided polygon can be split into n n-part spidrons. Alternate forms of linked triangular structures such as ladders and creepers can also be used to subdivide regular polygons. In the present paper new symmetric designs with inscribed regular polygons are constructed using n 6-part ladders. Also several new tiling patterns are created using these designs General Terms Tiling, Algorit...
متن کاملThe Number of Symmetric Colorings of the Quaternion Group
We compute the number of symmetric r-colorings and the number of equivalence classes of symmetric r-colorings of the quaternion group.
متن کاملA note on regular colorings of two mode data
In a recent paper, Everett and Borgatti (1992bl generalized their earlier (1991) definition of regular (or role) coloring of graphs. They extended their previous results to demonstrate that colorings can be used to find regular partitionings in digraphs, networks and hypergraphs. The purpose of this note is to suggest an alternative to their hypergraph representation one that requires only fami...
متن کاملChannel Assignment with Separation in Wireless Networks Based on Regular Plane Tessellations
Abstract. The large development of wireless services and the scarcity of the usable frequencies require an efficient use of the radio spectrum which guarantees interference avoidance. The Channel Assignment (CA) problem achieves this goal by partitioning the radio spectrum into disjoint channels, and assigning channels to the network base stations so as to avoid interference. On a flat region w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 78 شماره
صفحات -
تاریخ انتشار 2006